Binary pattern recognition using Markov random fields and HMMs

نویسندگان

  • George Saon
  • Abdel Belaïd
چکیده

In this paper we present a stochastic framework for the recognition of binary random patterns which advantageously combine hmms and Markov random elds (mrfs). The hmm component of the model analyzes the image along one direction, in a speci c state observation probability given by the product of causal mrf-like pixel conditional probabilities. Aspects concerning de nition, training and recognition via this type of model are developed throughout the paper. Experiments were performed on handwritten digits and words in a small lexicon. For the latter, we report a 89.68% average word recognition rate on the srtp French postal cheque database (7057 words, 1779 scriptors).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Acoustic Modeling Based on Deep Conditional Random Fields

Acoustic modeling based on Hidden Markov Models (HMMs) is employed by state-of-theart stochastic speech recognition systems. In continuous density HMMs, the state scores are computed using Gaussian mixture models. On the other hand, Deep Neural Networks (DNN) can be used to compute the HMM state scores. This leads to significant improvement in the recognition accuracy. Conditional Random Fields...

متن کامل

Recognition of unconstrained handwritten words using Markov random fields and HMMs

In this paper we present a system for recognition of handwritten words on literal check amounts which advantageously combines HMMs and Markov random fields (MRFs). It operates, in a holistic manner, at pixel level on height normalised word images which are viewed as random field realizations. The HMM analyses the image along the horizontal writing direction, in a specific state observation prob...

متن کامل

Guest Editors' Introduction to the Special Section on Probabilistic Graphical Models

An exciting development over the last decade has been the gradually widespread adoption of probabilistic graphical models (PGMs) in many areas of computer vision and pattern recognition. Representing an integration of graph and probability theories, a number of families of graphical models have been studied in the statistics and machine learning literatures. Examples of directed graphical model...

متن کامل

Handwriting word recognition using windowed Bernoulli HMMs

Hidden Markov Models (HMMs) are now widely used for off-line handwriting recognition in many languages. As in speech recognition, they are usually built from shared, embedded HMMs at symbol level, where state-conditional probability density functions in each HMM are modeled with Gaussian mixtures. In contrast to speech recognition, however, it is unclear which kind of features should be used an...

متن کامل

Improving Phoneme Sequence Recognition using Phoneme Duration Information in DNN-HSMM

Improving phoneme recognition has attracted the attention of many researchers due to its applications in various fields of speech processing. Recent research achievements show that using deep neural network (DNN) in speech recognition systems significantly improves the performance of these systems. There are two phases in DNN-based phoneme recognition systems including training and testing. Mos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997